Transitive Closure and the Mechanization of Mathematics
نویسنده
چکیده
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کامل$L$-fuzzy approximation spaces and $L$-fuzzy topological spaces
The $L$-fuzzy approximation operator associated with an $L$-fuzzy approximation space $(X,R)$ turns out to be a saturated $L$-fuzzy closure (interior) operator on a set $X$ precisely when the relation $R$ is reflexive and transitive. We investigate the relations between $L$-fuzzy approximation spaces and $L$-(fuzzy) topological spaces.
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملAncestral Logic
Many e orts have been made in recent years to construct computerized systems for mechanizing general mathematical reasoning. Most of the systems are based on logics which are stronger than rst-order logic (FOL). However, there are good reasons to avoid using full second-order logic (SOL) for this task. We investigate a logic which is intermediate between FOL and SOL, and seems to be a particula...
متن کاملCalculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation
Abstract: An approach to calculate the exact transitive closure of a parameterized and normalized affine integer tuple relation is presented. A relation is normalized when it describes graphs of the chain topology only. A procedure of the normalization is attached. The exact transitive closure calculation is based on resolving a system of recurrence equations being formed from the input and out...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004